Impact of Meta-Heuristic Methods to Solve Multi-Depot Vehicle Routing Problems with Time Windows
نویسندگان
چکیده
منابع مشابه
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
The Capacitated Vehicle Routing Problem with Time Windows is an important combinatorial optimization problem consisting in the determination of the set of routes of minimum distance to deliver goods, using a fleet of identical vehicles with restricted capacity, so that vehicles must visit cus tomers within a time frame. A large number of algorithms have been proposed to solve single-objective f...
متن کاملAn Effective Search Framework Combining Meta-Heuristics to Solve the Vehicle Routing Problems with Time Windows
Many delivery problems in real-world applications such as the newspaper delivery and courier services can be formulated as capacitated vehicle routing problems (VRPs) [10], which we want to route a number of vehicles with limited capacity in order to satisfy customer requests with the minimal operational cost. This is usually measured by the number of vehicles used multiplied by the total dista...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملHeuristic methods for vehicle routing problem with time windows
This paper documents our investigation into various heuristic methods to solve the vehicle routing problem with time windows (VRPTW) to near optimal solutions. The objective of the VRPTW is to serve a number of customers within prede®ned time windows at minimum cost (in terms of distance travelled), without violating the capacity and total trip time constraints for each vehicle. Combinatorial o...
متن کاملHeuristic approaches to vehicle routing with backhauls and time windows
The vehicle routing problem with backhauls and time windows (VRPBTW) involves the pickup and delivery of goods at different customer locations, with earliest and latest time deadlines, and varying demands. The demands are serviced using capacitated vehicles with limited route time. Moreover, all deliveries (linehauls) must be done before the pick-ups (backhauls). The objective of the problem is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Engineering and Applied Sciences
سال: 2014
ISSN: 1816-949X
DOI: 10.36478/jeasci.2014.263.267